How Many Argument Digits are Needed to Produce n Result Digits?
نویسنده
چکیده
In the LFT approach to Exact Real Arithmetic, we study the question how many argument digits are needed to produce a certain number of result digits. We present upper and lower bounds for many simple functions and operations, and for exponential and square root.
منابع مشابه
Using multiple-precision arithmetic
There are many different kinds of problems for which high precision calculation can be useful. The most common situation involves a computation that is numerically unstable, so that using double precision is not sufficient to get the final result as accurately as it is needed. We will use the term “significant digits” to mean the number of equivalent decimal digits of precision, as opposed to t...
متن کاملDesign and Synthesis of High Speed Low Power Signed Digit Adders
Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to {–1, 0, 1}, and finally adding the tra...
متن کاملA decimal code to describe the growth stages of sesame (Sesamum orientale L.)
A standard description of growth stages for crops/plants is necessary not only for determining and improving cultural practices, but also to facilitate enhanced communication among producers, researchers, and educators. It also could help in unifying experimental results. Many different descriptions of growth stages are currently available for many crops, but there are no codes for sesame (Sesa...
متن کاملOn graph coloring check-digit method
We show a method how to convert any graph into the binary number and vice versa. We derive upper bound for maximum number of graphs, that, have fixed number of vertices and can be colored with n colors (n is any given number). Proof for the result is outlined. Next, graph coloring based check-digit scheme is proposed. We use quantitative result derived, to show, that feasibility of the proposed...
متن کاملOn Binary Representations of Integers with Digits
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized by separating nonzero digits by at least one zero. We find an explicit formula that produces the digits of the expansion of an integer n which leads us to many generalized situations. Syntactical properties of such representations are also discussed. 1. A binary number system Integers n can be wri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 24 شماره
صفحات -
تاریخ انتشار 1999